239A - Two Bags of Potatoes - CodeForces Solution


greedy implementation math *1200

Please click on ads to support us..

Python Code:

def _input(): return map(int, input().split())

y, k, n = _input()
res= (y//k+1)*k-y
if res + y > n: 
    print(-1)
else:
    while res + y<=n:
        print(res, end = ' ')
        res+=k
            

C++ Code:

# include <bits\stdc++.h>
using namespace std;

int main()
{
	int y,k,n;
	cin>>y>>k>>n;
	
	int remainder = y%k;
	int rest_num = k-remainder;
	
	bool flag = false;
	if(y+rest_num <= n)
	{
		flag = true;
		cout<<rest_num<<" ";
	}
	
	while(y+rest_num+k <= n)
	{
		flag = true;
		cout<<rest_num+k<<" ";
		rest_num = rest_num+k;
	}
	
	if(flag == false)
	{
		cout<<-1<<endl;
	}
	
	cout<<endl;
	return 0;
}


Comments

Submit
0 Comments
More Questions

1302. Deepest Leaves Sum
1209. Remove All Adjacent Duplicates in String II
994. Rotting Oranges
983. Minimum Cost For Tickets
973. K Closest Points to Origin
969. Pancake Sorting
967. Numbers With Same Consecutive Differences
957. Prison Cells After N Days
946. Validate Stack Sequences
921. Minimum Add to Make Parentheses Valid
881. Boats to Save People
497. Random Point in Non-overlapping Rectangles
528. Random Pick with Weight
470. Implement Rand10() Using Rand7()
866. Prime Palindrome
1516A - Tit for Tat
622. Design Circular Queue
814. Binary Tree Pruning
791. Custom Sort String
787. Cheapest Flights Within K Stops
779. K-th Symbol in Grammar
701. Insert into a Binary Search Tree
429. N-ary Tree Level Order Traversal
739. Daily Temperatures
647. Palindromic Substrings
583. Delete Operation for Two Strings
518. Coin Change 2
516. Longest Palindromic Subsequence
468. Validate IP Address
450. Delete Node in a BST